Blind, individually-fair routing for heterogeneous servers in the Halfin-Whitt Regime
نویسندگان
چکیده
This paper is a continuation of [3]. In this paper, we consider a queueing system with many servers. Customers arrive into the system according to a Poisson process, and are either queued in a buffer with infinite room or routed to one of the servers according to a routing policy. Customers from the buffer are routed to servers according to a first-come-first-served rule. We consider work conserving routing policy, so that no server may be idle when at least one customer is in the buffer. Each customer leaves the system when its service requirement is fully processed. For servers, service times are independent exponentially distributed.
منابع مشابه
Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
In a call center, arriving customers must be routed to available servers, and servers that have just become available must be scheduled to help waiting customers. These dynamic routing and scheduling decisions are very difficult, because customers have different needs and servers have different skill levels. A further complication is that it is preferable that these decisions are made blindly; ...
متن کاملOptimal Control of Distributed Parallel Server Systems Under the Halfin and Whitt Regime
We consider a distributed parallel server system that consists of multiple server pools and a single customer class. We show that the minimum-expected-delay faster-server-first (MED-FSF) routing policy asymptotically minimizes the stationary distribution of the total queue length and the stationary delay probability in the Halfin and Whitt regime. We propose the minimum-expected-delay load-bala...
متن کاملFair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
In a call center, there is a natural trade-off between minimizing customer wait time and fairly dividing the workload amongst agents of different skill levels. The relevant control is the routing policy; that is, the decision concerning which agent should handle an arriving call when more than one agent is available. We formulate an optimization problem for a call center with heterogeneous agen...
متن کاملDynamic Routing in Large-Scale Service Systems with Heterogeneous Servers
Motivated by modern call centers, we consider large-scale service systems with multiple server pools and a single customer class. For such systems, we propose a simple routing rule which asymptotically minimizes the steady-state queue length and virtual waiting time. The proposed routing scheme is FSF which assigns customers to the Fastest Servers First. The asymptotic regime considered is the ...
متن کاملBlind Fair Routing in Large-Scale Service Systems
In a call center, arriving customers must be routed to available servers, and servers that have just become available must be scheduled to help waiting customers. These dynamic routing and scheduling decisions are very difficult, because customers have different needs and servers have different skill levels. A further complication is that it is preferable that these decisions are made blindly; ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009